Finite Quantification in Hierarchic Theorem Proving
Identifieur interne : 000A66 ( Main/Exploration ); précédent : 000A65; suivant : 000A67Finite Quantification in Hierarchic Theorem Proving
Auteurs : Peter Baumgartner [Australie] ; Joshua Bax [Australie] ; Uwe Waldmann [Allemagne]Source :
Abstract
Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably complete" even in the presence of free function symbols ranging into a background theory sort. In this paper we consider the case when all variables occurring below such function symbols are quantified over a finite subset of their domains. We present a non-naive decision procedure for background theories extended this way on top of black-box decision procedures for the EA-fragment of the background theory. In its core, it employs a model-guided instantiation strategy for obtaining pure background formulas that are equi-satisfiable with the original formula. Unlike traditional finite model finders, it avoids exhaustive instantiation and, hence, is expected to scale better with the size of the domains. Our main results in this paper are a correctness proof and first experimental results.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 002315
- to stream Hal, to step Curation: 002315
- to stream Hal, to step Checkpoint: 000A03
- to stream Main, to step Merge: 000A68
- to stream Main, to step Curation: 000A66
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Finite Quantification in Hierarchic Theorem Proving</title><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName><desc><address><country key="AU"></country></address></desc><listRelation><relation active="#struct-227648" type="direct"></relation><relation active="#struct-300765" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName><desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">http://nicta.com.au/</ref></desc><listRelation><relation active="#struct-300765" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName><desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">https://www.nicta.com.au</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Bax, Joshua" sort="Bax, Joshua" uniqKey="Bax J" first="Joshua" last="Bax">Joshua Bax</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-74662" status="VALID"><orgName>Australian National University</orgName><orgName type="acronym">ANU</orgName><desc><address><addrLine>The Australian National University Canberra ACT 0200 Australia</addrLine><country key="AU"></country></address><ref type="url">http://www.anu.edu.au/index.php</ref></desc></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName><orgName type="acronym">MPII</orgName><desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine><country key="DE"></country></address><ref type="url">http://www.mpi-inf.mpg.de/</ref></desc><listRelation><relation active="#struct-300044" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country><orgName type="university">Société Max-Planck</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-01087873</idno><idno type="halId">hal-01087873</idno><idno type="halUri">https://hal.inria.fr/hal-01087873</idno><idno type="url">https://hal.inria.fr/hal-01087873</idno><date when="2014-07">2014-07</date><idno type="wicri:Area/Hal/Corpus">002315</idno><idno type="wicri:Area/Hal/Curation">002315</idno><idno type="wicri:Area/Hal/Checkpoint">000A03</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000A03</idno><idno type="wicri:Area/Main/Merge">000A68</idno><idno type="wicri:Area/Main/Curation">000A66</idno><idno type="wicri:Area/Main/Exploration">000A66</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Finite Quantification in Hierarchic Theorem Proving</title><author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName><desc><address><country key="AU"></country></address></desc><listRelation><relation active="#struct-227648" type="direct"></relation><relation active="#struct-300765" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName><desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">http://nicta.com.au/</ref></desc><listRelation><relation active="#struct-300765" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName><desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine><country key="AU"></country></address><ref type="url">https://www.nicta.com.au</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Bax, Joshua" sort="Bax, Joshua" uniqKey="Bax J" first="Joshua" last="Bax">Joshua Bax</name><affiliation wicri:level="1"><hal:affiliation type="institution" xml:id="struct-74662" status="VALID"><orgName>Australian National University</orgName><orgName type="acronym">ANU</orgName><desc><address><addrLine>The Australian National University Canberra ACT 0200 Australia</addrLine><country key="AU"></country></address><ref type="url">http://www.anu.edu.au/index.php</ref></desc></hal:affiliation><country>Australie</country></affiliation></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName><orgName type="acronym">MPII</orgName><desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine><country key="DE"></country></address><ref type="url">http://www.mpi-inf.mpg.de/</ref></desc><listRelation><relation active="#struct-300044" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</country><orgName type="university">Société Max-Planck</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably complete" even in the presence of free function symbols ranging into a background theory sort. In this paper we consider the case when all variables occurring below such function symbols are quantified over a finite subset of their domains. We present a non-naive decision procedure for background theories extended this way on top of black-box decision procedures for the EA-fragment of the background theory. In its core, it employs a model-guided instantiation strategy for obtaining pure background formulas that are equi-satisfiable with the original formula. Unlike traditional finite model finders, it avoids exhaustive instantiation and, hence, is expected to scale better with the size of the domains. Our main results in this paper are a correctness proof and first experimental results.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Australie</li></country><orgName><li>Société Max-Planck</li></orgName></list><tree><country name="Australie"><noRegion><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name></noRegion><name sortKey="Bax, Joshua" sort="Bax, Joshua" uniqKey="Bax J" first="Joshua" last="Bax">Joshua Bax</name></country><country name="Allemagne"><noRegion><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A66 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000A66 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Hal:hal-01087873
|texte= Finite Quantification in Hierarchic Theorem Proving
}}
| This area was generated with Dilib version V0.6.33. |  |